Answering Fuzzy Queries over Fuzzy DL-Lite Ontologies

Abstract A prominent problem in knowledge representation is how to answer queries taking into account also the implicit consequences of an ontology representing domain knowledge. While this has been widely studied within realm description logic ontologies, it surprisingly neglected context vague or imprecise knowledge, particularly from point view mathematical fuzzy logic. In paper, we study answering conjunctive and threshold w.r.t. ontologies DL-Lite. Specifically, show through a rewriting approach that query consistent remains ${AC}^{0}$ data complexity, but highly dependent on selected triangular norm, which impact underlying semantics. For idempotent Gödel t-norm, provide effective method based reduction classical case.